#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=2010;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],f[maxn][maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n,h,l,r;cin>>n>>h>>l>>r;
  for(LL i=1;i<=n;i++){
    cin>>a[i];
  }
  memset(f,-0x3f,sizeof(f));
  f[0][0]=0;
  for(LL i=1;i<=n;i++){
    for(LL j=0;j<=h;j++){
        LL temp=0;
        if(j>=l&&j<=r) temp=1;
        f[i][j]=max(f[i-1][(j-a[i]+h)%h]+temp,f[i-1][ (j-(a[i]-1)+h)%h]+temp);
    }
  }
  LL maxv=0;
  for(LL i=1;i<=n;i++){
    for(LL j=l;j<=r;j++){
        maxv=max(maxv,f[i][j]);
    }
  }
  cout<<maxv<<"\n";
return 0;
}
